Rank-one LMIs and Lyapunov's inequality
نویسندگان
چکیده
We describe a new proof of the well-known Lyapunov's matrix inequality about the location of the eigenvalues of a matrix in some region of the complex plane. The proof makes use of standard facts from quadratic and semi-deenite programming. Links are established between the Lyapunov matrix, rank-one LMIs and the Lagrange multiplier arising in duality theory.
منابع مشابه
Model Reduction for Linear Parameter-Dependent Systems
The paper considers the problem of model reduction for a class of linear parameterdependent (LPD) systems. Three model reduction approaches: balanced truncation, balanced LQG truncation and gain-scheduledH∞ model reduction, are presented to reduce the dimension of LPD systems. For the former two approaches, conditions to proceed the reduction are given in terms of a finite number of linear matr...
متن کاملA New Asymptotic Expansion and Asymptotically Best Constants in Lyapunov's Theorem
A new asymptotic expansion is obtained in Lyapunov's Central Limit Theorem for distribution functions of centered and normed sums of independent random variables which are not necessary identically distributed. It is applied to determine the asymptotically best constants in the Berry{Esseen inequality, thus solving problems about their optimal values raised by Kolmogorov and Zolotarev.
متن کاملAll controllers for the general H∞ control problem: LMI existence conditions and state space formulas
Abs t rad -Th i s paper presents all controllers for the general ~'® control problem (with no assumptions on the plant matrices). Necessary and sufficient conditions for the existence of an ~® controller of any order are given in terms of three Linear Matrix Inequalities (LMIs). Our existence conditions are equivalent to Scherer's results, but with a more elementary derivation. Furthermore, we ...
متن کاملReliability and Efficiency of Extended Linearization Algorithms for General Robust Control Problems
This paper proves that a certain class of nonconvex matrix inequalities is equivalent to linear matrix inequalities (LMIs) plus a nonconvex rank constraint. From the equivalence, this paper proposes two heuristic algorithms, that is extended linearization algorithms, to solve LMIs with a rank constraint using LMI-based approach. Reliability and efficiency of the algorithms are investigated stat...
متن کاملD-Stability of Polynomial Matrices1
Necessary and suucient conditions are formulated for the zeros of an arbitrary polynomial matrix to belong to a given region D of the complex plane. The conditions stem from a general optimization methodology mixing LFRs, rank-one LMIs and the S-procedure. They are expressed as an LMI feasibility problem that can be tackled with widespread powerful interior-point methods. Most importantly, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Automat. Contr.
دوره 46 شماره
صفحات -
تاریخ انتشار 2001